Fuzzy uni cation degree
نویسندگان
چکیده
This paper constitutes a re nement of the fuzzy uni cation algorithm based on fuzzy compatibility relations, which we have developed with the aim of including the data type fuzzy set in a logic programming environment which supports a family of in nitely-valued logics. To be precise, we treat the problem of fuzzy uni cation by focusing on the distinction between general and speci c knowledge. For this purpose, we de ne the semantic component of the terms that will take place during the construction of the proof tree, we introduce a measure of the degree of similarity between the prototypes of two fuzzy sets and we propose a directional fuzzy uni cation algorithm. Finally, we develop the fuzzy uni cation degree associated with the most general fuzzy uni er of two atomic formulae.
منابع مشابه
Uni cation of Neural and Fuzzy Computing Paradigms
1 This paper describes a neuro-fuzzy paradigm which uni es several neural and fuzzy paradigms. Similarities and di erences among the various neural and fuzzy paradigms are analyzed and results have been used to derive the proposed uni cation paradigm. A conversion method is also presented to map perceptrons, radial basis networks and fuzzy systems onto each other. It will also be shown that , b...
متن کاملPerformance of weighted radial basis function classifiers
This paper describes Weighted Radial Basis Functions, a neuro-fuzzy uni cation algorithm which mixes Perceptrons and Radial Basis Functions. The algorithm has been tested as a pattern classi er in practical applications. Its performance are compared against those of other neural classi ers. The proposed algorithm has performance comparable or better than other neural algorithms, although it can...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملSyntactic Uni cation Problems under Constrained Substitutions
Some kind of practical problems such as security veri cation of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, uni cation problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational ...
متن کاملPolytypic Uni cation
Uni cation or two way pattern matching is the process of solving an equation involving two rst order terms with variables Uni cation is used in type inference in many pro gramming languages and in the execution of logic programs This means that uni cation algorithms have to be written over and over again for di erent term types Many other functions also make sense for a large class of datatypes...
متن کامل